/***************************************************************************
 *   Copyright (C) 2007 by Ivan Vasić                                      *
 *   ivasic@gmail.com                                                      *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef ANNOUNCERESPONSE_H
#define ANNOUNCERESPONSE_H

#include "response.h"
#include <QString>
#include <QMap>
#include <QHostAddress>
#include <QByteArray>
		
class BDictNode;
class BListNode;


/**
 * @author Ivan Vasić <ivasic@gmail.com>
*/
class AnnounceResponse : public Response
{
	struct Peer
	{
		QString peerID;
		QString ip;
		quint16 port;
	};
	
	
	public:
		AnnounceResponse(int _interval, int _complete, int _incomplete);
		~AnnounceResponse();
		
		void addPeer(const QString& id, const QHostAddress& ip, const quint16 port);
		
		QByteArray toString() const;
		
	private:
		bool m_compact;
		BDictNode* root;
		BListNode* peers;
		int interval;
		int complete;
		int incomplete;
		QList<Peer> peerMap;
};

#endif
